Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/TRCSRSLASHEx4_4_Luc96b

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(f₂(g₁(X), Y)) -> F₂(X, f₂(g₁(X), Y))
ACTIVE₁(g₁(X)) -> ACTIVE₁(X)
TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(g₁(X)) -> G₁(proper₁(X))
PROPER₁(g₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
F₂(ok₁(X1), ok₁(X2)) -> F₂(X1, X2)
G₁(mark₁(X)) -> G₁(X)
ACTIVE₁(g₁(X)) -> G₁(active₁(X))
PROPER₁(f₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(f₂(X1, X2)) -> F₂(proper₁(X1), proper₁(X2))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(f₂(X1, X2)) -> F₂(active₁(X1), X2)
G₁(ok₁(X)) -> G₁(X)
F₂(mark₁(X1), X2) -> F₂(X1, X2)
ACTIVE₁(f₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(f₂(X1, X2)) -> PROPER₁(X1)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(f₂(g₁(X), Y)) -> F₂(X, f₂(g₁(X), Y))
ACTIVE₁(g₁(X)) -> ACTIVE₁(X)
TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(g₁(X)) -> G₁(proper₁(X))
PROPER₁(g₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
F₂(ok₁(X1), ok₁(X2)) -> F₂(X1, X2)
G₁(mark₁(X)) -> G₁(X)
ACTIVE₁(g₁(X)) -> G₁(active₁(X))
PROPER₁(f₂(X1, X2)) -> PROPER₁(X2)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
PROPER₁(f₂(X1, X2)) -> F₂(proper₁(X1), proper₁(X2))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
ACTIVE₁(f₂(X1, X2)) -> F₂(active₁(X1), X2)
G₁(ok₁(X)) -> G₁(X)
F₂(mark₁(X1), X2) -> F₂(X1, X2)
ACTIVE₁(f₂(X1, X2)) -> ACTIVE₁(X1)
PROPER₁(f₂(X1, X2)) -> PROPER₁(X1)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 5 SCCs with 7 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G₁(mark₁(X)) -> G₁(X)
G₁(ok₁(X)) -> G₁(X)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

G₁(ok₁(X)) -> G₁(X)

The remaining pairs can at least by weakly be oriented.

G₁(mark₁(X)) -> G₁(X)

Used ordering: Combined order from the following AFS and order.
G₁(x1) = G₁(x1)
mark₁(x1) = x1
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G₁(mark₁(X)) -> G₁(X)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

G₁(mark₁(X)) -> G₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
G₁(x1) = G₁(x1)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

mark₁ > G₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(mark₁(X1), X2) -> F₂(X1, X2)
F₂(ok₁(X1), ok₁(X2)) -> F₂(X1, X2)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₂(ok₁(X1), ok₁(X2)) -> F₂(X1, X2)

The remaining pairs can at least by weakly be oriented.

F₂(mark₁(X1), X2) -> F₂(X1, X2)

Used ordering: Combined order from the following AFS and order.
F₂(x1, x2) = x2
mark₁(x1) = mark
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₂(mark₁(X1), X2) -> F₂(X1, X2)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₂(mark₁(X1), X2) -> F₂(X1, X2)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₂(x1, x2) = F₁(x1)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

[F₁, mark_1]

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(g₁(X)) -> PROPER₁(X)
PROPER₁(f₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(f₂(X1, X2)) -> PROPER₁(X1)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(f₂(X1, X2)) -> PROPER₁(X2)
PROPER₁(f₂(X1, X2)) -> PROPER₁(X1)

The remaining pairs can at least by weakly be oriented.

PROPER₁(g₁(X)) -> PROPER₁(X)

Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
g₁(x1) = x1
f₂(x1, x2) = f₂(x1, x2)

Lexicographic Path Order [19].
Precedence:

f₂ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(g₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(g₁(X)) -> PROPER₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
g₁(x1) = g₁(x1)

Lexicographic Path Order [19].
Precedence:

g₁ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(g₁(X)) -> ACTIVE₁(X)
ACTIVE₁(f₂(X1, X2)) -> ACTIVE₁(X1)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(f₂(X1, X2)) -> ACTIVE₁(X1)

The remaining pairs can at least by weakly be oriented.

ACTIVE₁(g₁(X)) -> ACTIVE₁(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
g₁(x1) = x1
f₂(x1, x2) = f₂(x1, x2)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(g₁(X)) -> ACTIVE₁(X)

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(g₁(X)) -> ACTIVE₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
g₁(x1) = g₁(x1)

Lexicographic Path Order [19].
Precedence:

g₁ > ACTIVE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

TOP₁(ok₁(X)) -> TOP₁(active₁(X))

The remaining pairs can at least by weakly be oriented.

TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

Used ordering: Combined order from the following AFS and order.
TOP₁(x1) = x1
ok₁(x1) = ok₁(x1)
active₁(x1) = active
mark₁(x1) = mark
proper₁(x1) = proper
f₂(x1, x2) = x1
g₁(x1) = x1

Lexicographic Path Order [19].
Precedence:

[ok₁, active] > [mark, proper]

The following usable rules [14] were oriented:

proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
g₁(mark₁(X)) -> mark₁(g₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
TOP₁(x1) = TOP₁(x1)
mark₁(x1) = mark₁(x1)
proper₁(x1) = x1
f₂(x1, x2) = f₂(x1, x2)
g₁(x1) = x1
ok₁(x1) = ok

Lexicographic Path Order [19].
Precedence:

ok > f₂ > mark₁

The following usable rules [14] were oriented:

proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
g₁(mark₁(X)) -> mark₁(g₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₂(g₁(X), Y)) -> mark₁(f₂(X, f₂(g₁(X), Y)))
active₁(f₂(X1, X2)) -> f₂(active₁(X1), X2)
active₁(g₁(X)) -> g₁(active₁(X))
f₂(mark₁(X1), X2) -> mark₁(f₂(X1, X2))
g₁(mark₁(X)) -> mark₁(g₁(X))
proper₁(f₂(X1, X2)) -> f₂(proper₁(X1), proper₁(X2))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₂(ok₁(X1), ok₁(X2)) -> ok₁(f₂(X1, X2))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.